Models of Adjunction in Minimalist Grammars
نویسنده
چکیده
Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies betweeen the three proposals, it does not exceed the complexity imposed by Move. The closure of Minimalist derivation tree languages under intersection with regular tree languages, however, is lost.
منابع مشابه
Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power
In this paper we investigate the weak generative capacity of minimalist grammars with late adjunction. We show that by viewing the Specifier Island Condition as the union of three separate constraints, we obtain a more nuanced perspective on previous results on constraint interaction in minimalist grammars, as well as the beginning of a map of the interaction between late adjunction and movemen...
متن کاملOn the Treatment of Scrambling and Adjunction in Minimalist Grammars
1 Introduction Stabler (2001:258) suggested that ""asymmetric" feature checking" is among the mechanisms that "remain to be carefully explored" within his "minimalist grammars" framework. Our presentation will undertake exactly this kind of exploration. Concretely, we are going to extend the "minimalist grammars" framework of Stabler (1997) (see also Harkema 2001; Michaelis 2001) by adding the ...
متن کاملOrder and Optionality: Minimalist Grammars with Adjunction
Adjuncts are characteristically optional, but many, such as adverbs and adjectives, are strictly ordered. In Minimalist Grammars (MGs), it is straightforward to account for optionality or ordering, but not both. I present an extension of MGs, MGs with Adjunction, which accounts for optionality and ordering simply by keeping track of two pieces of information at once: the original category of th...
متن کاملTree Adjunction as Minimalist Lowering
Even though Minimalist grammars are more powerful than TAG on the string level, the classes of tree languages the two define are incomparable. I give a constructive proof that if the standard Move operation in Minimalist grammars is replaced by Reset Lowering, every TAG tree language can be generated. The opposite does not hold, so the strong generative capacity of Minimalist grammars with Rese...
متن کاملOn the Treatment of Scrambling and Adjunction in Minimalist Grammars1
Stabler (2001:258) suggested that “‘asymmetric’ feature checking” is among the mechanisms that “remain to be carefully explored” within his “minimalist grammars” framework. Our paper will undertake exactly this kind of exploration. Concretely, we are going to extend the “minimalist grammars” framework of Stabler (1997) (see also Harkema 2001; Michaelis 2001) by adding the operations adjoin and ...
متن کامل